broadcast domination in tori
نویسندگان
چکیده
the broadcast domination number of the cartesian product of two cycles is completely determined.
منابع مشابه
Optimal broadcast domination in polynomial time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination powers. Broadcast domination assigns an integer power f(v) ≥ 0 to each vertex v of a given graph, such that every vertex of the graph is within distance f(v) from some vertex v having f(v) ≥ 1. The optimal broadcast d...
متن کاملBroadcast domination in graph products of paths
Let γb(G) denote the broadcast domination number for a graph G. In [Discrete Applied Math. 154 (2006), 59–75], Dunbar et al. determined the value of γb(G), where G is the Cartesian product of two paths. In this paper, we evaluate the value of γb(G), whenever G is the strong product, the direct product and the lexicographic product of two paths.
متن کاملPower domination in cylinders, tori, and generalized Petersen graphs
A set S of vertices is defined to be a power dominating set (PDS) of a graph G if every vertex and every edge in G can be monitored by the set S according to a set of rules for power system monitoring. The minimum cardinality of a PDS of G is its power domination number. In this article, we find upper bounds for the power domination number of some families of Cartesian products of graphs: the c...
متن کاملCircuit-Switched Broadcast in Multi-Port 2D Tori
This paper studies the one-to-all broadcast in a circuit-switched 2D torus of any size with-port capability. This is a generalization of the one-port and all-port models. Existing results, as compared to ours, can only solve very restricted sizes of tori, and use more numbers of steps. 1 Introduction One primary communication in an interconnection network is the one-to-all broadcast, where a so...
متن کاملA linear-time algorithm for broadcast domination in a tree
The broadcast domination problem is a variant of the classical minimum dominating set problem in which a transmitter of power p at vertex v is capable of dominating (broadcasting to) all vertices within distance p from v. Our goal is to assign a broadcast power f(v) to every vertex v in a graph such that ∑ v∈V f(v) is minimized, and such that every vertex u with f(u) = 0 is within distance f(v)...
متن کاملBroadcast Domination on Block Graphs in Linear Time
A broadcast domination on a graph assigns an integer value f(u) ≥ 0 to each vertex u, such that every vertex u with f(u) = 0 is within distance f(v) from a vertex v with f(v) > 0. The Broadcast Domination problem seeks to compute a broadcast domination where the sum of the assigned values is minimized. We show that Broadcast Domination can be solved in linear time on block graphs. For general g...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
transactions on combinatoricsناشر: university of isfahan
ISSN 2251-8657
دوره 4
شماره 4 2015
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023